Inductive Inference of an Approximate Concept from Positive Data
نویسنده
چکیده
In ordinary learning paradigm, a target concept, whose examples are fed to an inference machine, is assumed to belong to a hypothesis space which is given in advance. However this assumption is not appropriate, if we want an inference machine to infer or to discover an unknown rule which explains examples or data obtained from scientific experiments. In their previous paper, Mukouchi and Arikawa discussed both refut ability and inferability of a hypothesis space from examples. In this paper, we take a minimal concept as an approximate concept within a hypothesis space, and discuss inferability of a minimal concept of the target concept which may not belong to the hypothesis space. That is, we force an inference machine to converge to a minimal concept of the target concept, if there are minimal concepts of the target concept within the hypothesis space. We also show that there are some rich hypothesis spaces that are minimally inferable from positive data.
منابع مشابه
Learning Recursive Concepts with Anomalies
This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios in which the learner is successful if its final hypothesis describes a finite variant of the target concept – henceforth called learning with anomalies. As usual, we distinguish between learning from only positive data and learning from positive
متن کاملFunctional Brain Response to Emotional Muical Stimuli in Depression, Using INLA Approach for Approximate Bayesian Inference
Introduction: One of the vital skills which has an impact on emotional health and well-being is the regulation of emotions. In recent years, the neural basis of this process has been considered widely. One of the powerful tools for eliciting and regulating emotion is music. The Anterior Cingulate Cortex (ACC) is part of the emotional neural circuitry involved in Major Depressive Disorder (MDD)....
متن کاملInductive inference of approximations for recursive concepts
This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios where the learner is successful if its final hypothesis describes a finite variant of the target concept, i.e., learning with anomalies. Learning from positive data only and from both positive and negative data is distinguished. The following learning models are studied: learning in ...
متن کاملHypothesis Formation and Language Acquisition with an Infinitely-Often Correct Teacher
The presence of an "infinitely-often correct teacher" in scientific inference and language acquisition is motivated and studied. The treatment is abstract. In the practice of science, a scientist performs experiments to gather experimental data about some phenomenon, and then tries to construct an explanation (or theory) for the phenomenon. A model for the practice of science is an inductive in...
متن کاملFinding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data
A pattern is a string of constant symbols and variables. The language de ned by a pattern p is the set of constant strings obtained from p by substituting nonempty constant strings for variables in p. In this paper we are concerning with polynomial time inference from positive data of the class of unions of a bounded number of pattern languages. We introduce a syntactic notion of minimal multip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994